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 17, 2026 19:15Victor MerckléVictor MerckléScore: 17,901Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 17, 2026 19:1617,868155,966,226147,236,0001,074,0002,113,536
2Jun 17, 2026 19:1617,891156,146,212147,360,0001,136,0002,113,536
3Jun 17, 2026 19:1617,892156,101,672147,400,0001,107,0002,113,536
4Jun 17, 2026 19:1617,898156,191,679147,493,0001,066,0002,113,536
5Jun 17, 2026 19:1617,901156,174,634147,521,0001,064,0002,113,536
6Jun 17, 2026 19:1617,913156,266,155147,597,0001,082,0002,113,536
7Jun 17, 2026 19:1617,928156,377,386147,727,0001,078,0002,113,536
8Jun 17, 2026 19:1618,000157,049,321148,308,0001,097,0002,113,536
9Jun 17, 2026 19:1618,075158,864,059148,950,0001,078,0002,113,536