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 10, 2026 16:08Victor MerckléVictor MerckléScore: 6,468Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 10, 2026 16:086,38160,591,88451,943,0001,021,0002,113,536
2Jun 10, 2026 16:086,41160,745,90751,201,0002,016,0002,113,536
3Jun 10, 2026 16:086,43360,953,06352,380,0001,019,0002,113,536
4Jun 10, 2026 16:086,43860,994,57952,409,0001,030,0002,113,536
5Jun 10, 2026 16:086,46861,202,94852,666,0001,021,0002,113,536
6Jun 10, 2026 16:086,48161,343,70352,766,0001,034,0002,113,536
7Jun 10, 2026 16:086,48561,371,58951,821,0002,006,0002,113,536
8Jun 10, 2026 16:086,54761,905,83252,341,0002,003,0002,113,536
9Jun 10, 2026 16:086,64563,335,97754,128,0001,026,0002,113,536