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 23, 2026 12:01Kevin HeaveyKevin HeaveyScore: 3,207Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 23, 2026 12:033,18835,105,78526,465,000020,480
2Sep 23, 2026 12:033,19836,125,49725,545,0001,003,00020,480
3Sep 23, 2026 12:033,20235,418,27026,577,000020,480
4Sep 23, 2026 12:033,20435,384,60125,590,0001,009,00020,480
5Sep 23, 2026 12:033,20736,679,91325,600,0001,026,00020,480
6Sep 23, 2026 12:033,20836,171,70425,558,0001,069,00020,480
7Sep 23, 2026 12:033,20936,202,57526,635,000020,480
8Sep 23, 2026 12:033,21036,166,82925,633,0001,018,00020,480
9Sep 23, 2026 12:033,21235,450,12526,665,000020,480