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 listFeb 6, 2026 17:10Mikołaj UzarskiMikołaj UzarskiScore: 38,145Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 6, 2026 17:1038,129340,981,725315,467,0001,001,0002,281,472
2Feb 6, 2026 17:1038,131342,124,519316,487,00002,527,232
3Feb 6, 2026 17:1038,132344,678,685315,495,0001,001,0002,285,568
4Feb 6, 2026 17:1038,139347,825,297314,557,0001,997,0002,531,328
5Feb 6, 2026 17:1038,145340,620,878315,607,000998,0002,269,184
6Feb 6, 2026 17:1038,148341,616,408315,632,000998,0002,523,136
7Feb 6, 2026 17:1038,203342,207,877315,084,0002,000,0002,527,232
8Feb 6, 2026 17:1038,210344,941,201317,139,00002,269,184
9Feb 6, 2026 17:1038,225344,220,169315,270,0002,001,0002,285,568