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 listMar 14, 2026 22:51Ondřej PolaneckýOndřej PolaneckýScore: 20,778Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 14, 2026 22:5120,130189,148,372164,079,0003,001,0002,277,376
2Mar 14, 2026 22:5120,778202,194,030171,454,0001,002,0002,277,376
3Mar 14, 2026 22:5120,794203,949,599172,589,00002,277,376