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 6, 2026 17:31Danylo MocherniukDanylo MocherniukScore: 5,809Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 6, 2026 17:315,79570,686,99646,098,0002,004,0002,392,064
2Apr 6, 2026 17:315,80469,033,35247,173,0001,003,0002,297,856
3Apr 6, 2026 17:315,80468,770,15346,163,0002,007,0002,408,448
4Apr 6, 2026 17:315,80572,019,32146,171,0002,007,0002,297,856
5Apr 6, 2026 17:315,80974,768,71747,211,0001,004,0002,297,856
6Apr 6, 2026 17:315,83171,807,45546,380,0002,016,0002,297,856
7Apr 6, 2026 17:315,85071,622,33047,544,0001,011,0002,297,856
8Apr 6, 2026 17:315,85174,387,26247,549,0001,011,0002,297,856
9Apr 6, 2026 17:315,86175,152,59947,634,0001,013,0002,404,352