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 listSep 3, 2026 21:22boop34boop34Score: 11,652Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 21:2311,625107,563,20495,268,0001,225,0002,113,536
2Sep 3, 2026 21:2311,638106,699,67295,522,0001,081,0002,113,536
3Sep 3, 2026 21:2311,641106,457,14195,536,0001,086,0002,113,536
4Sep 3, 2026 21:2311,648106,572,46695,584,0001,096,0002,113,536
5Sep 3, 2026 21:2311,652106,598,90795,616,0001,099,0002,113,536
6Sep 3, 2026 21:2311,652106,590,03695,647,0001,072,0002,113,536
7Sep 3, 2026 21:2311,667106,652,73395,761,0001,077,0002,113,536
8Sep 3, 2026 21:2311,668106,723,93995,836,0001,013,0002,113,536
9Sep 3, 2026 21:2311,675106,782,51895,829,0001,081,0002,113,536