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 listApr 3, 2026 07:48SODIUM IS NOT A CATSODIUM IS NOT A CATScore: 71,168Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 3, 2026 07:4870,987615,900,198535,171,00054,017,0002,510,848
2Apr 3, 2026 07:4871,057614,828,450524,799,00064,975,0002,375,680
3Apr 3, 2026 07:4871,086618,656,231532,009,00058,001,0002,289,664
4Apr 3, 2026 07:4871,109619,264,961538,186,00052,018,0002,269,184
5Apr 3, 2026 07:4871,168622,677,195507,737,00082,957,0002,527,232
6Apr 3, 2026 07:4871,170615,845,084520,748,00069,966,0002,289,664
7Apr 3, 2026 07:4871,238620,863,942537,344,00053,934,0002,289,664
8Apr 3, 2026 07:4871,249617,375,685521,439,00069,924,0002,519,040
9Apr 3, 2026 07:4871,292612,464,091529,752,00061,970,0002,527,232