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 listAug 2, 2026 17:39George SeabridgeGeorge SeabridgeScore: 11,211Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 17:3911,098102,021,75189,922,0002,194,0002,113,536
2Aug 2, 2026 17:3911,100113,599,64689,926,0002,211,0002,113,536
3Aug 2, 2026 17:3911,184115,154,93090,582,0002,252,0002,113,536
4Aug 2, 2026 17:3911,193102,764,63090,713,0002,195,0002,113,536
5Aug 2, 2026 17:3911,211102,949,20390,825,0002,231,0002,113,536
6Aug 2, 2026 17:3911,233115,009,17791,211,0002,023,0002,113,536
7Aug 2, 2026 17:3911,286114,540,42791,423,0002,256,0002,113,536
8Aug 2, 2026 17:3911,310113,876,45891,624,0002,257,0002,113,536
9Aug 2, 2026 17:3911,376116,544,09792,406,0002,022,0002,113,536