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 listMay 7, 2026 10:57wnwnScore: 3,421Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 7, 2026 10:573,37842,840,30826,995,0001,049,0002,490,368
2May 7, 2026 10:573,39142,233,04927,095,0001,054,0002,486,272
3May 7, 2026 10:573,40343,591,86027,193,0001,059,0002,494,464
4May 7, 2026 10:573,41443,047,17627,241,0001,100,0002,486,272
5May 7, 2026 10:573,42140,605,54127,314,0001,084,0002,473,984
6May 7, 2026 10:573,42650,742,07427,301,0001,140,0002,486,272
7May 7, 2026 10:573,55543,775,23128,438,0001,076,0002,486,272
8May 7, 2026 10:573,57344,375,06128,563,0001,093,0002,494,464
9May 7, 2026 10:573,59744,019,34728,784,0001,077,0002,486,272