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 listJul 5, 2026 20:43Kevin HeaveyKevin HeaveyScore: 6,096Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 20:456,01559,483,67648,785,0001,146,0002,117,632
2Jul 5, 2026 20:456,06359,888,64149,316,0001,014,0002,117,632
3Jul 5, 2026 20:456,07059,893,39049,152,0001,229,0002,117,632
4Jul 5, 2026 20:456,07560,023,46849,163,0001,261,0002,117,632
5Jul 5, 2026 20:456,09660,166,28249,434,0001,163,0002,117,632
6Jul 5, 2026 20:456,14360,503,54049,820,0001,170,0002,117,632
7Jul 5, 2026 20:456,14960,600,68049,883,0001,157,0002,117,632
8Jul 5, 2026 20:456,16460,729,40749,951,0001,216,0002,117,632
9Jul 5, 2026 20:456,36862,483,51051,625,0001,235,0002,117,632