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 15, 2026 20:09Praveen SinghPraveen SinghScore: 69,716Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 15, 2026 20:0969,398597,468,087524,005,00052,000,0002,469,888
2Jan 15, 2026 20:0969,524605,327,255515,048,00062,005,0002,289,664
3Jan 15, 2026 20:0969,602603,493,005519,727,00057,969,0002,289,664
4Jan 15, 2026 20:0969,625601,675,955511,904,00065,987,0002,289,664
5Jan 15, 2026 20:0969,716605,673,877515,684,00062,961,0002,473,984
6Jan 15, 2026 20:0969,751606,105,725521,939,00056,993,0002,293,760
7Jan 15, 2026 20:0969,781610,658,680521,168,00058,018,0002,289,664
8Jan 15, 2026 20:0969,794607,019,532534,267,00045,022,0002,469,888
9Jan 15, 2026 20:0969,817608,221,610529,440,00050,041,0002,473,984