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 listJan 31, 2026 00:13olliecrowolliecrowScore: 9,569Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 31, 2026 00:138,17295,255,96565,831,0001,994,0002,428,928
2Jan 31, 2026 00:138,24796,734,36665,434,0003,020,0002,269,184
3Jan 31, 2026 00:138,31890,461,10065,038,0004,002,0002,289,664
4Jan 31, 2026 00:139,569106,071,11077,410,0002,010,0002,424,832
5Jan 31, 2026 00:139,726112,256,30777,739,0002,989,0002,334,720
6Jan 31, 2026 00:1310,405111,812,00482,347,0004,016,0002,453,504