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 listApr 19, 2026 06:16wnwnScore: 3,715Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 19, 2026 06:163,67356,466,55929,468,0001,016,0002,277,376
2Apr 19, 2026 06:163,67450,303,76129,476,0001,016,0002,535,424
3Apr 19, 2026 06:163,68054,879,31929,527,0001,018,0002,486,272
4Apr 19, 2026 06:163,68952,200,44629,596,0001,020,0002,277,376
5Apr 19, 2026 06:163,71556,691,20429,841,000994,0002,498,560
6Apr 19, 2026 06:163,71555,494,23828,846,0001,989,0002,277,376
7Apr 19, 2026 06:163,74051,197,74229,040,0002,002,0002,277,376
8Apr 19, 2026 06:163,77654,676,60830,327,0001,010,0002,277,376
9Apr 19, 2026 06:163,87960,963,02930,180,0002,012,0002,490,368