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 listMar 28, 2026 20:52BrillentypBrillentypScore: 56,961Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 28, 2026 20:5256,943498,417,104471,628,000999,0002,289,664
2Mar 28, 2026 20:5256,943503,433,333470,625,0001,998,0002,351,104
3Mar 28, 2026 20:5256,956501,952,115470,736,0001,998,0002,289,664
4Mar 28, 2026 20:5256,959497,610,018471,762,000999,0002,289,664
5Mar 28, 2026 20:5256,961495,830,249470,774,0001,999,0002,367,488
6Mar 28, 2026 20:5256,962498,975,796470,786,0001,999,0002,281,472
7Mar 28, 2026 20:5256,964495,867,655470,804,0001,999,0002,289,664
8Mar 28, 2026 20:5256,967500,388,161470,824,0001,999,0002,289,664
9Mar 28, 2026 20:5256,972498,035,265471,867,000999,0002,289,664