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 listAug 26, 2026 22:09Victor MerckléVictor MerckléScore: 4,291Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 26, 2026 22:104,02341,717,97732,258,0001,135,0002,113,536
2Aug 26, 2026 22:104,25143,641,32234,279,0001,011,0002,113,536
3Aug 26, 2026 22:104,26344,443,85334,253,0001,136,0002,113,536
4Aug 26, 2026 22:104,29043,934,72634,558,0001,049,0002,113,536
5Aug 26, 2026 22:104,29144,013,34834,496,0001,124,0002,113,536
6Aug 26, 2026 22:104,30344,082,09334,592,0001,124,0002,113,536
7Aug 26, 2026 22:104,31044,208,23734,634,0001,139,0002,113,536
8Aug 26, 2026 22:104,32744,343,44534,784,0001,131,0002,113,536
9Aug 26, 2026 22:104,33844,386,94834,862,0001,145,0002,113,536