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 24, 2026 03:35Nao MinamiNao MinamiScore: 90,406Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 24, 2026 03:3590,310760,808,711691,209,00058,366,0002,113,536
2Oct 24, 2026 03:3590,387761,606,235691,383,00058,830,0002,113,536
3Oct 24, 2026 03:3590,398762,899,242691,374,00058,936,0002,113,536
4Oct 24, 2026 03:3590,400761,688,828691,600,00058,725,0002,113,536
5Oct 24, 2026 03:3590,406761,505,481691,509,00058,865,0002,113,536
6Oct 24, 2026 03:3590,409761,642,373691,359,00059,039,0002,113,536
7Oct 24, 2026 03:3590,413761,747,298691,620,00058,813,0002,113,536
8Oct 24, 2026 03:3590,436762,003,283691,609,00059,011,0002,113,536
9Oct 24, 2026 03:3590,461762,248,811692,117,00058,710,0002,113,536