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 6, 2026 07:38Teow Hua JunTeow Hua JunScore: 30,270Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 07:3930,150260,194,801249,190,0001,057,0002,117,632stderr
2Jul 6, 2026 07:3930,168260,050,484249,337,0001,058,0002,117,632stderr
3Jul 6, 2026 07:3930,198260,320,794249,592,0001,054,0002,117,632stderr
4Jul 6, 2026 07:3930,255261,331,920250,054,0001,064,0002,117,632stderr
5Jul 6, 2026 07:3930,270260,951,379250,200,0001,041,0002,117,632stderr
6Jul 6, 2026 07:3930,282261,434,688250,273,0001,072,0002,117,632stderr
7Jul 6, 2026 07:3930,291261,145,484250,261,0001,159,0002,117,632stderr
8Jul 6, 2026 07:3930,299261,147,695250,423,0001,061,0002,117,632stderr
9Jul 6, 2026 07:3930,302261,626,829250,442,0001,068,0002,117,632stderr