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 18, 2026 05:58Elijah KinElijah KinScore: 50,198Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 18, 2026 05:5850,179445,517,281415,488,0001,001,0002,273,280
2Mar 18, 2026 05:5850,198443,458,063414,645,0001,998,0002,273,280
3Mar 18, 2026 05:5850,205441,046,909413,708,0002,997,0002,277,376