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 listApr 10, 2026 17:11Danylo MocherniukDanylo MocherniukScore: 5,619Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 10, 2026 17:115,60567,825,53645,513,0001,011,0002,433,024
2Apr 10, 2026 17:115,61975,736,58445,622,0001,013,0002,297,856
3Apr 10, 2026 17:115,64275,927,45644,838,0001,992,0002,297,856