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 29, 2026 20:44sandheep rajkumarsandheep rajkumarScore: 71,455Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 29, 2026 20:4471,022617,125,033528,535,00060,946,0002,285,568
2Jan 29, 2026 20:4471,278626,193,230526,652,00064,957,0002,453,504
3Jan 29, 2026 20:4471,354625,528,046529,213,00063,025,0002,342,912
4Jan 29, 2026 20:4471,425619,023,577526,847,00065,980,0002,342,912
5Jan 29, 2026 20:4471,455616,985,305524,068,00069,009,0002,293,760
6Jan 29, 2026 20:4471,469620,863,054524,174,00069,022,0002,289,664
7Jan 29, 2026 20:4471,480621,837,054530,253,00063,030,0002,342,912
8Jan 29, 2026 20:4471,489619,437,011526,431,00066,927,0002,285,568
9Jan 29, 2026 20:4471,553621,198,841527,900,00065,987,0002,285,568