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 listFeb 15, 2026 22:27wnwnScore: 9,937Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 15, 2026 22:278,84099,346,32265,328,0008,040,0002,351,104
2Feb 15, 2026 22:278,859104,134,82866,480,0007,050,0002,408,448
3Feb 15, 2026 22:278,992103,197,71067,572,0007,059,0002,465,792
4Feb 15, 2026 22:279,937107,417,81074,434,0008,047,0002,510,848
5Feb 15, 2026 22:2710,048104,431,45475,361,0008,038,0002,334,720
6Feb 15, 2026 22:2710,179109,165,85076,437,0008,046,0002,469,888