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 03:41wnwnScore: 4,625Success
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 03:424,15955,860,48733,501,0001,015,0002,277,376
2Apr 19, 2026 03:424,17264,515,88633,609,0001,018,0002,494,464
3Apr 19, 2026 03:424,19662,467,56532,836,0001,990,0002,531,328
4Apr 19, 2026 03:424,19763,178,26333,837,000995,0002,498,560
5Apr 19, 2026 03:424,19959,561,63732,862,0001,991,0002,490,368
6Apr 19, 2026 03:424,21056,706,48632,945,0001,996,0002,531,328
7Apr 19, 2026 03:414,62558,128,51637,380,0001,010,0002,494,464
8Apr 19, 2026 03:414,62765,729,68637,397,0001,010,0002,486,272
9Apr 19, 2026 03:414,63066,351,45337,415,0001,011,0002,498,560
10Apr 19, 2026 03:414,63259,831,01837,434,0001,011,0002,531,328
11Apr 19, 2026 03:414,68062,701,19536,854,0001,992,0002,498,560
12Apr 19, 2026 03:414,73065,482,59938,253,0001,006,0002,490,368