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 listOct 5, 2026 02:25FrederickFrederickScore: 13,650Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 5, 2026 02:2513,464122,080,247110,740,0001,014,0002,113,536
2Oct 5, 2026 02:2513,476122,168,176110,837,0001,014,0002,113,536
3Oct 5, 2026 02:2513,646123,541,414112,248,0001,014,0002,113,536
4Oct 5, 2026 02:2513,646125,106,144112,255,0001,014,0002,113,536
5Oct 5, 2026 02:2513,650123,561,968112,289,0001,013,0002,113,536
6Oct 5, 2026 02:2513,652123,638,627112,303,0001,015,0002,113,536
7Oct 5, 2026 02:2513,658123,624,018112,353,0001,014,0002,113,536
8Oct 5, 2026 02:2513,663123,631,356112,391,0001,015,0002,113,536
9Oct 5, 2026 02:2513,969126,469,913114,938,0001,007,0002,113,536