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 09:33wnwnScore: 3,594Success
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 09:343,54552,536,72528,408,0001,014,0002,277,376
2Apr 19, 2026 09:333,54651,253,48728,420,0001,015,0002,498,560
3Apr 19, 2026 09:343,55952,670,43628,520,0001,018,0002,277,376
4Apr 19, 2026 09:333,59456,021,72327,843,0001,988,0002,277,376
5Apr 19, 2026 09:343,65453,289,67329,320,0001,011,0002,490,368
6Apr 19, 2026 09:333,74858,682,10829,103,0002,007,0002,498,560