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 19, 2026 17:53Ondřej PolaneckýOndřej PolaneckýScore: 105,488Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 19, 2026 17:54104,576877,741,455859,931,0008,051,0002,121,728stderr
2Jul 19, 2026 17:54104,618877,863,032860,303,0008,030,0002,117,632stderr
3Jul 19, 2026 17:54104,963881,037,146862,912,0008,282,0002,117,632stderr
4Jul 19, 2026 17:54105,061881,710,337863,761,0008,249,0002,117,632stderr
5Jul 19, 2026 17:54105,488885,152,155867,549,0008,002,0002,121,728stderr
6Jul 19, 2026 17:54105,697886,995,366868,935,0008,352,0002,117,632stderr
7Jul 19, 2026 17:54105,732887,764,077869,564,0008,015,0002,117,632stderr
8Jul 19, 2026 17:54106,584895,623,148876,662,0007,986,0002,121,728stderr
9Jul 19, 2026 17:54106,678895,122,355877,050,0008,385,0002,117,632stderr