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 listJul 7, 2026 14:21Kevin HeaveyKevin HeaveyScore: 4,060Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 14:213,96742,543,26331,729,0001,199,0002,117,632
2Jul 7, 2026 14:213,96742,400,38431,744,0001,187,0002,117,632
3Jul 7, 2026 14:213,97742,565,05831,857,0001,153,0002,117,632
4Jul 7, 2026 14:214,00642,734,58832,091,0001,160,0002,117,632
5Jul 7, 2026 14:214,06043,260,33832,500,0001,200,0002,117,632
6Jul 7, 2026 14:214,06643,239,72232,600,0001,153,0002,117,632
7Jul 7, 2026 14:214,07043,358,62632,607,0001,176,0002,117,632
8Jul 7, 2026 14:214,07243,381,46032,782,0001,017,0002,117,632
9Jul 7, 2026 14:214,10243,697,85432,850,0001,198,0002,117,632