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 25, 2026 16:24Kenzie_RTKenzie_RTScore: 63,893Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 25, 2026 16:2563,761539,394,904528,145,0001,076,0002,113,536
2May 25, 2026 16:2563,787539,233,008528,254,0001,179,0002,113,536
3May 25, 2026 16:2563,855539,974,205528,946,0001,051,0002,113,536
4May 25, 2026 16:2563,887542,661,626529,242,0001,022,0002,113,536
5May 25, 2026 16:2563,893539,621,053529,233,0001,086,0002,113,536
6May 25, 2026 16:2563,895541,285,259529,273,0001,059,0002,113,536
7May 25, 2026 16:2564,537547,238,738534,534,0001,126,0002,113,536
8May 25, 2026 16:2564,741548,187,185536,270,0001,084,0002,113,536
9May 25, 2026 16:2565,047550,095,265538,767,0001,125,0002,113,536