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 18, 2026 10:11wnwnScore: 7,142Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 10:116,19976,159,15848,423,0003,026,0002,461,696
2Feb 18, 2026 10:116,28074,298,81846,114,0006,014,0002,314,240
3Feb 18, 2026 10:116,31377,272,55250,380,0002,015,0002,355,200
4Feb 18, 2026 10:117,09982,423,13554,927,0003,994,0002,523,136
5Feb 18, 2026 10:117,13883,689,47655,230,0004,016,0002,506,752
6Feb 18, 2026 10:117,13983,279,10856,241,0003,012,0002,383,872
7Feb 18, 2026 10:117,14282,465,39757,267,0002,009,0002,510,848
8Feb 18, 2026 10:117,26484,724,81557,281,0003,014,0002,342,912
9Feb 18, 2026 10:117,27389,150,70956,342,0004,024,0002,510,848
10Feb 18, 2026 10:117,30086,664,15457,565,0003,029,0002,494,464
11Feb 18, 2026 10:117,44789,432,39856,829,0004,985,0002,482,176
12Feb 18, 2026 10:117,48282,876,35059,095,0003,004,0002,502,656