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 listAug 3, 2026 14:36Teow Hua JunTeow Hua JunScore: 11,082Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 14:3611,069101,706,72190,794,0001,086,0002,117,632stderr
2Aug 3, 2026 14:3611,071101,676,78490,815,0001,076,0002,117,632stderr
3Aug 3, 2026 14:3611,077101,742,04290,851,0001,092,0002,117,632stderr
4Aug 3, 2026 14:3611,078101,860,20390,854,0001,099,0002,117,632stderr
5Aug 3, 2026 14:3611,082101,826,18390,899,0001,084,0002,117,632stderr
6Aug 3, 2026 14:3611,083101,778,38690,902,0001,091,0002,117,632stderr
7Aug 3, 2026 14:3611,083101,883,82290,882,0001,110,0002,117,632stderr
8Aug 3, 2026 14:3611,085101,870,66390,925,0001,087,0002,117,632stderr
9Aug 3, 2026 14:3611,090101,814,38190,928,0001,120,0002,117,632stderr