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 listSep 24, 2026 03:05wnwnScore: 3,559Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 03:053,45237,455,58327,516,0001,136,00020,480
2Sep 24, 2026 03:053,52038,010,97927,985,0001,237,00020,480
3Sep 24, 2026 03:053,54140,124,32228,155,0001,239,00020,480
4Sep 24, 2026 03:053,54138,149,03728,273,0001,119,0002,113,536
5Sep 24, 2026 03:053,55938,995,67928,407,0001,140,0002,113,536
6Sep 24, 2026 03:053,56038,249,41328,314,0001,239,00020,480
7Sep 24, 2026 03:053,59639,234,92528,617,0001,235,0002,113,536
8Sep 24, 2026 03:053,60639,375,33028,818,0001,114,0002,113,536
9Sep 24, 2026 03:053,69640,071,90329,021,0001,656,00020,480