Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listFeb 23, 2026 13:53satoru.netsatoru.netScore: 67,237Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 23, 2026 13:5367,189580,408,375503,702,00053,968,0002,277,376
2Feb 23, 2026 13:5367,194580,019,351497,741,00059,968,0002,277,376
3Feb 23, 2026 13:5367,207582,011,608502,836,00054,982,0002,277,376
4Feb 23, 2026 13:5367,218580,025,888493,918,00063,989,0002,400,256
5Feb 23, 2026 13:5367,237587,569,745499,059,00059,007,0002,404,352
6Feb 23, 2026 13:5367,324582,466,966498,810,00059,977,0002,392,064
7Feb 23, 2026 13:5367,371582,302,243501,160,00058,018,0002,277,376
8Feb 23, 2026 13:5367,379580,559,950494,220,00065,028,0002,408,448
9Feb 23, 2026 13:5367,392582,555,982496,428,00062,927,0002,277,376