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 14:42Danylo MocherniukDanylo MocherniukScore: 6,660Success
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 14:426,63082,815,16052,025,0003,001,0002,297,856
2Apr 6, 2026 14:426,65677,583,85452,233,0003,013,0002,396,160
3Apr 6, 2026 14:426,65977,084,20652,258,0003,014,0002,506,752
4Apr 6, 2026 14:426,66076,465,22553,266,0002,010,0002,293,760
5Apr 6, 2026 14:426,67180,834,15852,353,0003,020,0002,297,856
6Apr 6, 2026 14:426,67477,046,84052,373,0003,021,0002,408,448