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 listMay 9, 2026 22:56Josu San MartinJosu San MartinScore: 4,939Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 9, 2026 22:574,79057,218,00738,535,0001,228,0002,379,776
2May 9, 2026 22:574,80154,341,00938,659,0001,197,0002,371,584
3May 9, 2026 22:574,84257,715,28438,970,0001,221,0002,363,392
4May 9, 2026 22:574,85956,594,35039,128,0001,208,0002,375,680
5May 9, 2026 22:574,93955,776,38139,800,0001,196,0002,371,584
6May 9, 2026 22:574,95859,437,72439,968,0001,189,0002,387,968
7May 9, 2026 22:574,97557,626,69940,258,0001,036,0002,359,296
8May 9, 2026 22:574,97756,713,49840,278,0001,033,0002,375,680
9May 9, 2026 22:575,00155,164,00040,302,0001,208,0002,371,584