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 listJun 27, 2026 14:42Victor MerckléVictor MerckléScore: 4,165Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 27, 2026 14:424,14542,312,87233,272,0001,135,0002,113,536
2Jun 27, 2026 14:424,14642,269,72133,389,0001,024,0002,113,536
3Jun 27, 2026 14:424,15742,438,74933,467,0001,041,0002,113,536
4Jun 27, 2026 14:424,15942,509,36533,482,0001,042,0002,113,536
5Jun 27, 2026 14:424,16542,484,44133,549,0001,026,0002,113,536
6Jun 27, 2026 14:424,16942,496,73133,496,0001,110,0002,113,536
7Jun 27, 2026 14:424,21342,910,22933,912,0001,060,0002,113,536
8Jun 27, 2026 14:424,21642,947,05233,950,0001,044,0002,113,536
9Jun 27, 2026 14:424,22643,376,60333,953,0001,127,0002,113,536