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 20, 2026 00:30Mikołaj UzarskiMikołaj UzarskiScore: 5,524Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 20, 2026 00:305,49673,430,69239,536,0006,082,0002,473,984
2Feb 20, 2026 00:305,50975,948,61841,664,0004,064,0002,441,216
3Feb 20, 2026 00:315,51780,255,98238,827,0006,968,0002,416,640
4Feb 20, 2026 00:315,52468,713,91437,875,0007,973,0002,469,888
5Feb 20, 2026 00:305,58468,402,89338,285,0008,060,0002,445,312
6Feb 20, 2026 00:315,58768,656,13339,315,0007,056,0002,424,832