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 17, 2026 03:51Victor MerckléVictor MerckléScore: 32,289Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 17, 2026 03:5432,146276,709,986265,781,0001,036,0002,117,632stderr
2Sep 17, 2026 03:5432,244277,477,310266,497,0001,135,0002,117,632stderr
3Sep 17, 2026 03:5432,270277,666,927266,733,0001,112,0002,117,632stderr
4Sep 17, 2026 03:5432,273277,738,036266,731,0001,141,0002,117,632stderr
5Sep 17, 2026 03:5432,289277,885,197266,986,0001,018,0002,117,632stderr
6Sep 17, 2026 03:5432,307278,026,167267,019,0001,135,0002,117,632stderr
7Sep 17, 2026 03:5432,325278,219,070267,187,0001,114,0002,117,632stderr
8Sep 17, 2026 03:5432,330278,213,020267,332,0001,015,0002,117,632stderr
9Sep 17, 2026 03:5432,356278,918,272267,413,0001,143,0002,117,632stderr