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 listMar 8, 2026 06:59caandocaandoScore: 8,243Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 8, 2026 08:337,29287,870,63159,517,0001,008,0002,281,472
2Mar 8, 2026 06:597,29992,590,55059,569,0001,009,0002,281,472
3Mar 8, 2026 06:597,31288,557,20259,678,0001,011,0002,527,232
4Mar 8, 2026 08:337,31784,481,89258,738,0001,991,0002,527,232
5Mar 8, 2026 06:597,32689,458,94659,813,000996,0002,281,472
6Mar 8, 2026 08:337,46083,695,56859,917,0001,997,0002,527,232
7Mar 8, 2026 08:338,24394,203,62666,402,0002,012,0002,281,472
8Mar 8, 2026 08:338,25089,852,31867,469,0001,007,0002,281,472
9Mar 8, 2026 08:338,27393,264,67267,654,0001,009,0002,281,472
10Mar 8, 2026 06:598,27393,635,09967,658,0001,009,0002,527,232
11Mar 8, 2026 06:598,43492,377,33368,001,0002,000,0002,281,472
12Mar 8, 2026 06:598,44597,160,71368,095,0002,002,0002,506,752