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 listNov 25, 2025 08:27Ham-HamHam-HamScore: 72,143Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 25, 2025 08:2872,068624,617,799533,144,00065,017,0002,375,680
2Nov 25, 2025 08:2772,107623,128,884536,544,00061,947,0002,371,584
3Nov 25, 2025 08:2872,142628,508,699534,800,00063,976,0002,498,560
4Nov 25, 2025 08:2772,143624,371,635536,812,00061,978,0002,269,184
5Nov 25, 2025 08:2772,286623,361,379539,979,00059,997,0002,273,280
6Nov 25, 2025 08:2872,536626,287,687554,045,00048,003,0002,269,184