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 13, 2026 10:49wnwnScore: 4,091Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 13, 2026 10:504,05859,925,74732,661,0001,020,0002,490,368
2Apr 13, 2026 10:494,07659,551,39832,834,000994,0002,277,376
3Apr 13, 2026 10:494,07760,191,17931,850,0001,990,0002,494,464
4Apr 13, 2026 10:494,07860,592,93431,859,0001,991,0002,494,464
5Apr 13, 2026 10:494,08056,404,56931,871,0001,991,0002,277,376
6Apr 13, 2026 10:504,08560,310,42431,912,0001,994,0002,490,368
7Apr 13, 2026 10:494,09156,355,91031,959,0001,997,0002,494,464
8Apr 13, 2026 10:494,11857,934,08832,171,0002,010,0002,277,376
9Apr 13, 2026 10:504,19760,164,09532,842,0001,990,0002,498,560
10Apr 13, 2026 10:494,19861,122,60932,850,0001,990,0002,277,376
11Apr 13, 2026 10:494,21358,869,22832,968,0001,998,0002,277,376
12Apr 13, 2026 10:494,21358,672,10932,968,0001,998,0002,502,656