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 26, 2026 13:36wnwnScore: 3,455Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 13:373,43148,059,94827,464,0001,017,0002,482,176
2Apr 26, 2026 13:373,43349,539,14427,479,0001,017,0002,310,144
3Apr 26, 2026 13:373,44245,977,92027,553,0001,020,0002,498,560
4Apr 26, 2026 13:373,44348,702,35627,557,0001,020,0002,473,984
5Apr 26, 2026 13:373,45539,568,80327,656,0001,024,0002,478,080
6Apr 26, 2026 13:373,46243,886,06926,760,0001,982,0002,478,080
7Apr 26, 2026 13:373,46848,203,02926,800,0001,985,0002,494,464
8Apr 26, 2026 13:373,47642,631,69026,865,0001,990,0002,490,368
9Apr 26, 2026 13:373,51344,534,06528,156,0001,005,0002,330,624