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 18, 2026 11:22wnwnScore: 4,583Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 18, 2026 11:224,41065,984,34635,583,0001,016,0002,277,376
2Apr 18, 2026 11:244,41566,347,51535,629,0001,017,0002,277,376
3Apr 18, 2026 11:224,43860,837,14435,840,000995,0002,277,376
4Apr 18, 2026 11:224,43868,608,68634,843,0001,991,0002,277,376
5Apr 18, 2026 11:244,58361,800,54736,035,0002,001,0002,498,560
6Apr 18, 2026 11:244,61162,375,37737,266,0001,007,0002,277,376
7Apr 18, 2026 11:224,71162,994,59537,093,0002,005,0002,494,464
8Apr 18, 2026 11:224,71559,251,86137,128,0002,006,0002,498,560
9Apr 18, 2026 11:224,74359,262,94238,356,0001,009,0002,498,560