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 6, 2026 07:13Victor MerckléVictor MerckléScore: 4,225Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 07:144,19742,808,06433,745,0001,093,0002,117,632stderr
2Jul 6, 2026 07:144,20242,929,98533,778,0001,106,0002,117,632stderr
3Jul 6, 2026 07:144,20542,735,64033,811,0001,094,0002,117,632stderr
4Jul 6, 2026 07:144,22443,056,88834,018,0001,045,0002,117,632stderr
5Jul 6, 2026 07:144,22543,038,49534,038,0001,036,0002,117,632stderr
6Jul 6, 2026 07:144,22743,406,42834,015,0001,071,0002,117,632stderr
7Jul 6, 2026 07:144,23143,100,42634,099,0001,026,0002,117,632stderr
8Jul 6, 2026 07:144,27343,473,26734,372,0001,102,0002,117,632stderr
9Jul 6, 2026 07:144,28643,594,57434,573,0001,007,0002,117,632stderr