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 listJun 12, 2026 15:10Victor MerckléVictor MerckléScore: 7,556Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 12, 2026 15:107,38768,975,42059,123,0002,192,0002,113,536
2Jun 12, 2026 15:107,40069,086,54459,236,0002,186,0002,113,536
3Jun 12, 2026 15:107,40169,142,98359,251,0002,180,0002,113,536
4Jun 12, 2026 15:107,42269,203,61759,434,0002,174,0002,113,536
5Jun 12, 2026 15:107,55670,432,15760,383,0002,332,0002,113,536
6Jun 12, 2026 15:107,57670,600,75860,663,0002,223,0002,113,536
7Jun 12, 2026 15:107,58370,601,61660,814,0002,125,0002,113,536
8Jun 12, 2026 15:107,73171,786,29561,954,0002,219,0002,113,536
9Jun 12, 2026 15:107,76072,021,55662,203,0002,207,0002,113,536