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 18, 2026 16:46wnwnScore: 4,459Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 18, 2026 16:474,44066,595,51034,862,0001,992,0002,494,464
2Apr 18, 2026 16:474,44660,906,11334,908,0001,994,0002,277,376
3Apr 18, 2026 16:474,45458,281,24934,970,0001,998,0002,277,376
4Apr 18, 2026 16:474,45463,648,42634,971,0001,998,0002,494,464
5Apr 18, 2026 16:474,45662,968,26134,983,0001,999,0002,269,184
6Apr 18, 2026 16:474,45658,889,65134,989,0001,999,0002,490,368
7Apr 18, 2026 16:464,45959,748,08435,007,0002,000,0002,494,464
8Apr 18, 2026 16:464,46358,241,42935,042,0002,002,0002,478,080
9Apr 18, 2026 16:464,48358,246,73235,196,0002,011,0002,277,376
10Apr 18, 2026 16:474,53759,619,20436,640,0001,017,0002,494,464
11Apr 18, 2026 16:474,55868,053,91236,837,000995,0002,494,464
12Apr 18, 2026 16:474,68658,527,34236,901,0001,994,0002,494,464