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 listJul 26, 2026 22:04boop34boop34Score: 44,331Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 26, 2026 22:0444,182376,733,816355,323,00011,390,00020,480
2Jul 26, 2026 22:0444,255377,603,757356,153,00011,167,00020,480
3Jul 26, 2026 22:0444,264377,637,279357,203,00010,192,00020,480
4Jul 26, 2026 22:0444,301378,422,165356,320,00011,381,00020,480
5Jul 26, 2026 22:0444,331378,034,555355,500,00012,448,00020,480
6Jul 26, 2026 22:0444,379378,396,866355,437,00012,909,00020,480
7Jul 26, 2026 22:0444,420379,066,554356,070,00012,624,00020,480
8Jul 26, 2026 22:0445,166384,982,981361,411,00013,469,00020,480
9Jul 26, 2026 22:0446,324394,682,412370,020,00014,476,00020,480