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 13, 2026 21:16Daniel MastalerzDaniel MastalerzScore: 6,656Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 13, 2026 21:166,63483,282,32153,060,0002,002,0002,265,088
2Feb 13, 2026 21:166,64279,829,26851,117,0004,009,0002,342,912
3Feb 13, 2026 21:166,64682,336,37150,147,0005,014,0002,310,144
4Feb 13, 2026 21:166,65178,626,37650,184,0005,018,0002,277,376
5Feb 13, 2026 21:166,65581,531,01850,219,0005,021,0002,273,280
6Feb 13, 2026 21:166,65678,288,31450,223,0005,022,0002,322,432
7Feb 13, 2026 21:166,65683,642,31652,231,0003,013,0002,322,432
8Feb 13, 2026 21:166,66779,453,79349,296,0006,036,0002,306,048
9Feb 13, 2026 21:166,66880,705,46250,312,0005,031,0002,523,136
10Feb 13, 2026 21:166,76279,607,86652,113,0004,008,0002,273,280
11Feb 13, 2026 21:166,76976,624,03451,163,0005,016,0002,269,184
12Feb 13, 2026 21:166,79881,906,56650,375,0006,045,0002,297,856